Conjunctive normal form

Results: 92



#Item
11Sage Reference Manual: Symbolic Logic Release 6.7 The Sage Development Team

Sage Reference Manual: Symbolic Logic Release 6.7 The Sage Development Team

Add to Reading List

Source URL: doc.sagemath.org

Language: English - Date: 2015-06-24 05:21:38
12CS 170  Algorithms Spring 2009

CS 170 Algorithms Spring 2009

Add to Reading List

Source URL: www-inst.eecs.berkeley.edu

Language: English - Date: 2009-05-04 23:56:17
13Learning Partially Observable Action Models: Efficient Algorithms Dafna Shahaf Allen Chang Eyal Amir Computer Science Department University of Illinois, Urbana-Champaign Urbana, IL 61801, USA {dshahaf2,achang6,eyal}@uiuc

Learning Partially Observable Action Models: Efficient Algorithms Dafna Shahaf Allen Chang Eyal Amir Computer Science Department University of Illinois, Urbana-Champaign Urbana, IL 61801, USA {dshahaf2,achang6,eyal}@uiuc

Add to Reading List

Source URL: infolab.stanford.edu

Language: English - Date: 2010-08-28 23:41:19
14GUARDED TRANSFORMATION FOR THE MODAL µ-CALCULUS FLORIAN BRUSE, OLIVER FRIEDMANN, AND MARTIN LANGE Abstract. Guarded normal form requires occurrences of fixpoint variables in a µ-calculus-formula to occur under the scop

GUARDED TRANSFORMATION FOR THE MODAL µ-CALCULUS FLORIAN BRUSE, OLIVER FRIEDMANN, AND MARTIN LANGE Abstract. Guarded normal form requires occurrences of fixpoint variables in a µ-calculus-formula to occur under the scop

Add to Reading List

Source URL: files.oliverfriedmann.de

Language: English - Date: 2013-05-03 12:27:57
15Relaxed Survey Propagation: A Sum-Product Algorithm for Max-SAT Hai Leong Chieu Wee Sun Lee  Singapore MIT Alliance

Relaxed Survey Propagation: A Sum-Product Algorithm for Max-SAT Hai Leong Chieu Wee Sun Lee Singapore MIT Alliance

Add to Reading List

Source URL: www.comp.nus.edu.sg

Language: English - Date: 2008-11-06 22:58:52
16On the possibility of faster SAT algorithms Mihai Pˇatra¸scu∗ AT&T Labs Florham Park, NJ  Ryan Williams†

On the possibility of faster SAT algorithms Mihai Pˇatra¸scu∗ AT&T Labs Florham Park, NJ Ryan Williams†

Add to Reading List

Source URL: www.stanford.edu

Language: English - Date: 2009-11-12 23:47:30
17On Problems as Hard as CNF-SAT∗ Marek Cygan† Holger Dell‡  Jesper Nederlofk

On Problems as Hard as CNF-SAT∗ Marek Cygan† Holger Dell‡ Jesper Nederlofk

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2014-03-27 21:09:14
18Proofs and Refutations, and Z3 Leonardo de Moura and Nikolaj Bjørner Microsoft Research Abstract Z3 [3] is a state-of-the-art Satisfiability Modulo Theories (SMT) solver freely available from Microsoft Research. It solv

Proofs and Refutations, and Z3 Leonardo de Moura and Nikolaj Bjørner Microsoft Research Abstract Z3 [3] is a state-of-the-art Satisfiability Modulo Theories (SMT) solver freely available from Microsoft Research. It solv

Add to Reading List

Source URL: research.microsoft.com

Language: English - Date: 2009-07-21 19:11:06
19Finding Minimal Unsatisfiable Cores of Declarative Specifications Emina Torlak, Felix Sheng-Ho Chang and Daniel Jackson MIT Computer Science and Artificial Intelligence Laboratory {emina, fschang, dnj}@mit.edu

Finding Minimal Unsatisfiable Cores of Declarative Specifications Emina Torlak, Felix Sheng-Ho Chang and Daniel Jackson MIT Computer Science and Artificial Intelligence Laboratory {emina, fschang, dnj}@mit.edu

Add to Reading List

Source URL: homes.cs.washington.edu

Language: English - Date: 2014-08-13 19:26:58
20How to Make Manual Conjunctive Normal Form Queries Work in Patents Search Le Zhao and Jamie Callan Language Technologies Institute School of Computer Science Carnegie Mellon University

How to Make Manual Conjunctive Normal Form Queries Work in Patents Search Le Zhao and Jamie Callan Language Technologies Institute School of Computer Science Carnegie Mellon University

Add to Reading List

Source URL: trec.nist.gov

Language: English - Date: 2012-02-03 09:41:50